On the Relation between Edge and Vertex Modelling in Shape Analysis
نویسندگان
چکیده
Objects in the plane with no obvious landmarks can be described by either vertex transformation vectors or edge transformation vectors. In this paper we provide the relation between the two transformation vectors. Grenander & Miller (1994) use a multivariate normal distribution with a block circulant covariance matrix to model the edge transformation vector. This type of model is also feasible for the vertex transformation vector and in certain cases the free parameters of the two models match up in a simple way. A vertex model and an edge model are applied to a data set of sand particles to explore shape variability.
منابع مشابه
Some results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملA note on vertex-edge Wiener indices of graphs
The vertex-edge Wiener index of a simple connected graph G is defined as the sum of distances between vertices and edges of G. Two possible distances D_1(u,e|G) and D_2(u,e|G) between a vertex u and an edge e of G were considered in the literature and according to them, the corresponding vertex-edge Wiener indices W_{ve_1}(G) and W_{ve_2}(G) were introduced. In this paper, we present exact form...
متن کاملThe explicit relation among the edge versions of detour index
The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملOn the edge reverse Wiener indices of TUC4C8(S) nanotubes
The edge versions of reverse Wiener indices were introduced by Mahmiani et al. very recently. In this paper, we find their relation with ordinary (vertex) Wiener index in some graphs. Also, we compute them for trees and TUC4C8(s) naotubes.
متن کامل